Algorithms for restriction map comparisons

نویسندگان

  • Michael S. Waterman
  • Temple F. Smith
  • H. L. Katcher
چکیده

An algorithm is presented which compares two restriction maps, yielding a measure of distance between the maps and relating the maps by an alignment. This new algorithm finds the minimum weighted sum of genetic events required to convert one map into the other, where the genetic events are the appearance/disappearance of restriction sites and changes in the number of bases between restriction sites. The algorithm is illustrated by comparison of the beta-delta region of the globin gene cluster of four primate species. The results are in excellent agreement with known evolutionary relationships.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic programming algorithms for restriction map comparison

For most sequence comparison problems there is a corresponding map comparison algorithm. While map data may appear to be incompatible with dynamic programming, we show in this paper that the rigor and efficiency of dynamic programming algorithms carry over to the map comparison algorithms. We present algorithms for restriction map comparison that deal with two types of map errors: (i) closely s...

متن کامل

Two Novel Chaos-Based Algorithms for Image and Video Watermarking

In this paper we introduce two innovative image and video watermarking algorithms. The paper’s main emphasis is on the use of chaotic maps to boost the algorithms’ security and resistance against attacks. By encrypting the watermark information in a one dimensional chaotic map, we make the extraction of watermark for potential attackers very hard. In another approach, we select embedding po...

متن کامل

Image encryption based on chaotic tent map in time and frequency domains

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...

متن کامل

Extensive linkage disequilibrium in the achaete-scute complex of Drosophila melanogaster.

We have analyzed the level of gametic association between restriction map variants in a sample of 44 X chromosomes from a natural population of Drosophila melanogaster. Of 21 pairwise tests involving 7 restriction map polymorphisms in the yellow-achaete-scute complex, 17 were found to be significant, including some between restriction sites over 80 kb apart. Three-way linkage disequilibria and ...

متن کامل

DNA Mapping Algorithms: Topological Mapping

There are several basic approaches that can be used in attempting to produce high-resolution DNA restriction maps. A standard approach is the match/merge approach in which first the topology of the map units being mapped together is suppressed and lists of potential matches between fragments are generated, and second the topology is introduced to eliminate matchlists which are inconsistent with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Nucleic acids research

دوره 12 1 Pt 1  شماره 

صفحات  -

تاریخ انتشار 1984